An In-Storage Implementation of Smith-Waterman in Resistive CAM
نویسندگان
چکیده
An in-storage implementation of the Smith-Waterman sequence alignment algorithm on a resistive content addressable memory (ReCAM) based storage is proposed. The ReCAM native compare operation is used to find matching basepairs in a fixed number of cycles, regardless of the sequence length. Our in-storage implementation is simulated and compared to state-of-the-art systolic arrays and GPU-based solutions. We show a 3.4x higher throughput and an order of magnitude lower
منابع مشابه
In-Data vs. Near-Data Processing: The Case for Processing in Resistive CAM
Near-data in-storage processing research has been gaining momentum in recent years. Typical processing-in-storage architecture places a single or several processing cores inside the storage and allows data processing without transferring it to the host CPU. Since this approach replicates von Neumann architecture inside storage, it is exposed to the problems faced by von Neumann architecture, es...
متن کاملPACT: G: From Near-Data Processing to In-Data Processing-in-Storage
Near-data in-storage processing research has been gaining momentum in recent years. Typical processing-in-storage architecture places a single or several processing cores inside the storage and allows data processing without transferring it to the host CPU. Since this approach replicates von Neumann architecture inside storage, it is exposed to the problems faced by von Neumann architectures, e...
متن کاملDevelopment and Implementation of Novel Data Compression Technique for Accelerate DNA Sequence Alignment Based on Smith–Waterman Algorithm
Abstract— This paper presents the development and implementation of high performance accelerating and optimization technique for DNA sequences alignment algorithm. The scope of the paper focuses on speed optimization and memory reduction of the existing algorithm on initialization module. The novel development and implementation of the optimization using data compression technique for accelerat...
متن کاملSix-fold speed-up of Smith-Waterman sequence database searches using parallel processing on common microprocessors
MOTIVATION Sequence database searching is among the most important and challenging tasks in bioinformatics. The ultimate choice of sequence-search algorithm is that of Smith-Waterman. However, because of the computationally demanding nature of this method, heuristic programs or special-purpose hardware alternatives have been developed. Increased speed has been obtained at the cost of reduced se...
متن کاملRevisiting the Speed-versus-Sensitivity Tradeoff in Pairwise Sequence Search
The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadratic time and space complexity. As a result, many algorithmic and architectural enhancements have been proposed to solve this problem, but at the cost of reduced sensitivity in the algorithms or significant expense in hardwa...
متن کامل